A New Super-Convergent Inclusion Function Form and its Use in Global Optimization

نویسنده

  • P. S. V. Nataraj
چکیده

Recently, Lin and Rokne [10] introduced the so-called Taylor-Bernstein form as an inclusion function form for multidimensional functions. This form was theoretically shown to have the super-convergence property. Here, we present an improvement of Lin and Rokne’s Taylor-Bernstein form to make it more effective in practice. We test and compare the super-convergence behavior of the proposed form with that of Lin and Rokne’s Taylor-Bernstein form and also with that of the Taylor model of Berz et al. [3]. We obtain super-convergence of orders up to 9 with the proposed form. Moreover, with the proposed form we quite easily obtain such high orders of super-convergence for up to 5− dim problems. We also investigate the use of higher order inclusion functions in the Moore-Skelboe (MS) algorithm of interval analysis (IA) for unconstrained global optimization. We use the improved TB form as an inclusion function in a prototype MS algorithm and also modify the cut-off test and termination condition in the algorithm. We test and compare on several examples the performances of the proposed algorithm, the MS algorithm, and the MS algorithm with the Taylor model of Berz et al. [3] as inclusion function. The results of these (preliminary) tests indicate that the proposed algorithm with the improved TB form as inclusion function is quite effective for low to medium dimension problems studied.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The modified BFGS method with new secant relation ‎for unconstrained optimization problems‎

Using Taylor's series we propose a modified secant relation to get a more accurate approximation of the second curvature of the objective function. Then, based on this modified secant relation we present a new BFGS method for solving unconstrained optimization problems. The proposed method make use of both gradient and function values while the usual secant relation uses only gradient values. U...

متن کامل

An efficient one-layer recurrent neural network for solving a class of nonsmooth optimization problems

Constrained optimization problems have a wide range of applications in science, economics, and engineering. In this paper, a neural network model is proposed to solve a class of nonsmooth constrained optimization problems with a nonsmooth convex objective function subject to nonlinear inequality and affine equality constraints. It is a one-layer non-penalty recurrent neural network based on the...

متن کامل

Fluid Injection Optimization Using Modified Global Dynamic Harmony Search

One of the mostly used enhanced oil recovery methods is the injection of water or gas under pressure to maintain or reverse the declining pressure in a reservoir. Several parameters should be optimized in a fluid injection process. The usual optimizing methods evaluate several scenarios to find the best solution. Since it is required to run the reservoir simulator hundreds of times, the process...

متن کامل

A generalized implicit enumeration algorithm for a class of integer nonlinear programming problems

Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to u...

متن کامل

A Discrete Hybrid Teaching-Learning-Based Optimization algorithm for optimization of space trusses

In this study, to enhance the optimization process, especially in the structural engineering field two well-known algorithms are merged together in order to achieve an improved hybrid algorithm. These two algorithms are Teaching-Learning Based Optimization (TLBO) and Harmony Search (HS) which have been used by most researchers in varied fields of science. The hybridized algorithm is called A Di...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002